A New DNA Implementation of Finite State Machines

Two new models for implementing finite state machines with DNA computing are presented. The operations used in both models are simple and easy to implement. Operations include immobilization of DNA strands onto paramagnetic beads, DNA hybridization, DNA ligation and restriction enzyme cleavage. Use of paramagnetic beads greatly reduces performance time and demonstrates DNA chip compatibility of the models. In one of the models, the length of DNA strands created during the intermediate operations are independent of the length of the input string. Optical extraction in both models detects the final state. * This research was partially supported by University of Tehran. † To whom correspondence should be addressed, E-mail: [email protected].